package DynamicProgramming.Easy;

public class LC0746 {
    public int minCostClimbingStairs(int[] cost) {
        int nScales = cost.length + 1;
        int[] dp = new int[nScales]; // 爬到第i阶的最小花费
        dp[0] = 0;
        dp[1] = 0;
        for (int i = 2; i < nScales; i++) {
            dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
        }
        return dp[nScales - 1];
    }
}
